Randomized Boolean decision trees: Several remarks
نویسندگان
چکیده
منابع مشابه
Randomized Boolean Decision Trees: Several Remarks
Assume we want to show that (a) the cost of any randomized decision tree computing a given Boolean function is at least c. To this end it suuces to prove that (b) there is a probability distribution over the set of all assignments to variables of that function with respect to which the average cost of any deterministic decision tree computing that function is at least c. Yao in 11] showed that ...
متن کاملOn Boolean Decision Trees with Faulty Nodes
We consider the problem of computing with faulty components in the context of the Boolean decision tree model, in which cost is measured by the number of input bits queried and the responses to queries are faulty with a xed probability. We show that if f can be represented in k-DNF form and in j-CNF form, then O(n log(min(k; j)=q)) queries suuce to compute f with error probability less than q, ...
متن کاملArthur-Merlin Games in Boolean Decision Trees
It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones Motivated by a question if randomization can signiicantly speed up a nondeterministic computation via a boolean decision tree, we address structural properties of Arthur-Merlin games in this model and prove some lower bounds. We consider two cases of interest, the rst when the length ...
متن کاملDecision Trees with Boolean Threshold Queries
We investigate decision trees in which one is allowed to query threshold functions of subsets of variables. We are mainly interested in the case were only queries of AND and OR are allowed. This model is a generalization of the classical decision tree model, and its complexity (depth) is related to the parallel time that is required to compute Boolean functions in certain CRCW PRAM machines wit...
متن کاملAverage-Case Lower Bounds for Noisy Boolean Decision Trees
We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00071-1